# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase
from collections import deque


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def alphabetBoardPath(self, target: str) -> str:
        res = []
        curr_x = curr_y = 0

        for ch in target:
            value = ord(ch) - ord('a')
            next_x = value // 5
            next_y = value % 5

            if curr_x > next_x:
                res.append('U' * (curr_x - next_x))

            if curr_y > next_y:
                res.append('L' * (curr_y - next_y))

            if curr_x < next_x:
                res.append('D' * (next_x - curr_x))

            if curr_y < next_y:
                res.append('R' * (next_y - curr_y))

            curr_x = next_x
            curr_y = next_y
            res.append('!')

        return ''.join(res)


if __name__ == '__main__':
    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ('leet',"DDR!UURRR!!DDD!"),
        ('code', 'RR!DDRR!UUL!R!')
    ]

    for case_item in testcases:
        solution = Solution()
        # 获取测试用的case和期待的执行结果

        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        # TODO: 调用对应方法，需要替换具体的方法
        exec_result = solution.alphabetBoardPath(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

